Some New Strategies for Theorem-Proving in First Order Logic with Equality
نویسندگان
چکیده
A method for encoding formulas in rst-order logic with equality into some equational logics and their associated propositional logics is presented. This yields some new strategies for theorem-proving in rst-order logic with equality. We outline the techniques and give a simple illustration of their use.
منابع مشابه
A Technique for Establishing Completeness Results in Theorem Proving with Equality
This is a summary of the methods and results of a longer paper of the same name which will appear elsewhere. The main result is that an automatic theorem proving system consisting of resolution, paramodulation, factoring, equality reversal, simplification and subsumption removal is complete in first-order logic with equality. When restricted to sets of equality units, the resulting system is ve...
متن کاملSystem Description: SpassVersion 3.0
Spass is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in Spass 3.0, including support for dynamic modal logics, relational logics and expressive description logics, additional renaming and selection strategies, and significant interface enhancements for human and...
متن کاملRefutational Theorem Proving Using Term-Rewriting Systems
In this paper we propose a new approach to theorem proving in first-order logic based on the term-rewriting method. First for propositional calculus, we introduce a canonical term-rewriting system for Boolean algebra. This system enables us to transform the first-order predicate calculus into a form of equational logic, and to develop several complete strategies (both clausal and nonclausal) fo...
متن کاملSystem Description: E-KRHyper
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-based handling of equality into the hyper tableau calculus. E-KRHyper extends our previous KRHyper system, which has been used in a number of applications in the field of knowledge representation. In contrast to most f...
متن کاملScavenger 0.1: A Theorem Prover Based on Conflict Resolution
This paper introduces Scavenger, the first theorem prover for pure first-order logic without equality based on the new conflict resolution calculus. Conflict resolution has a restricted resolution inference rule that resembles (a first-order generalization of) unit propagation as well as a rule for assuming decision literals and a rule for deriving new clauses by (a first-order generalization o...
متن کامل